Hybrid quantum-classical algorithms for solving quantum chemistry in Hamiltonian–wave-function space
نویسندگان
چکیده
The variational quantum eigensolver (VQE) typically optimizes parameters in a circuit to prepare eigenstates for system. Its application many problems may involve group of Hamiltonians, e.g., Hamiltonian molecule is function the nuclear configurations. In this paper we incorporate derivatives into VQE and develop some hybrid quantum-classical algorithms, which explore both wave-function spaces solving chemistry more efficiently. For geometry optimization, propose mutual gradient-descent algorithm that updates wave alternately, can give rapid convergence towards equilibrium structures molecules as demonstrated numerical simulations. Moreover, speed up calculation energy potential surface, establish differential equations govern how optimized change with intrinsic Hamiltonian. Our study suggests direction systems efficiently by considering function.
منابع مشابه
Improving quantum algorithms for quantum chemistry
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant. Our modification does not require additional ancilla qubits. Then, we demonstrate how many ope...
متن کاملHybrid classical-quantum dynamics
A hybrid formalism is proposed for interacting classical and quantum sytems. This formalism is mathematically consistent and reduces to standard classical and quantum mechanics in the case of no interaction. However, in the presence of interaction, the correspondence principle is violated. PACS numbers: 03.65.Bz, 03.65.Sq ∗ Electronic mail: [email protected], [email protected]
متن کاملA Hybrid Quantum-Classical Approach to Solving Scheduling Problems
An effective approach to solving complex problems is to decompose them and integrate dedicated solvers for those subproblems. We introduce a hybrid decomposition that incorporates: (1) a quantum annealer that samples from the configuration space of a relaxed problem to obtain strong candidate solutions, and (2) a classical processor that maintains a global search tree and enforces constraints o...
متن کاملQuantum versus Classical Online Algorithms with Advice and Logarithmic Space
In this paper, we consider online algorithms. Typically the model is investigated with respect to competitive ratio. We consider algorithms with restricted memory (space) and explore their power. We focus on quantum and classical online algorithms. We show that there are problems that can be better solved by quantum algorithms than classical ones in a case of logarithmic memory. Additionally, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2021
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.103.012413